By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.
Table of Contents
Search This Issue
Volume 16, Issue 4, pp. 599-778

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Optimal Mixed Graph Augmentation

Dan Gusfield

pp. 599-612

BibTeX  Abstract Full Text:  PDF

Oracles for Deterministic Versus Alternating Classes

William Gasarch

pp. 613-627

BibTeX  Abstract Full Text:  PDF

The Least Weight Subsequence Problem

D. S. Hirschberg and L. L. Larmore

pp. 628-638

BibTeX  Abstract Full Text:  PDF

A Communication-Time Tradeoff

Christos H. Papadimitriou and Jeffrey D. Ullman

pp. 639-646

BibTeX  Abstract Full Text:  PDF

The Discrete Geodesic Problem

Joseph S. B. Mitchell, David M. Mount, and Christos H. Papadimitriou

pp. 647-668

BibTeX  Abstract Full Text:  PDF

A $1.6$ Approximation Algorithm for Routing Multiterminal Nets

Teofilo F. Gonzalez and Sing-Ling Lee

pp. 669-704

BibTeX  Abstract Full Text:  PDF

List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations

B. John Oommen and E. R. Hansen

pp. 705-716

BibTeX  Abstract Full Text:  PDF

Generating Random Unlabelled Graphs

Nicholas C. Wormald

pp. 717-727

BibTeX  Abstract Full Text:  PDF

On Some Distance Problems in Fixed Orientations

P. Widmayer, Y. F. Wu, and C. K. Wong

pp. 728-746

BibTeX  Abstract Full Text:  PDF

Two Processor Scheduling is in $\mathcal{NC}$

David Helmbold and Ernst Mayr

pp. 747-759

BibTeX  Abstract Full Text:  PDF

Languages that Capture Complexity Classes

Neil Immerman

pp. 760-778

BibTeX  Abstract Full Text:  PDF